Routing through a dense channel with minimum total wire lengthFORMANN, M; WAGNER, D; WAGNER, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 267-283, issn 0196-6774Article

Multiple path routing algorithm for IP networksRIOS, Miguel; MARIANOV, Vladimir; AVAGLIANO, Andres et al.Computer communications. 2005, Vol 28, Num 7, pp 829-836, issn 0140-3664, 8 p.Article

Gemini: Probabilistic routing algorithm in structured P2P overlayMING LI; JINFENG HU; HAITAO DONG et al.Lecture notes in computer science. 2004, pp 519-526, issn 0302-9743, isbn 3-540-23564-7, 8 p.Conference Paper

Rearrangeable circuit-switched hypercube architectures for routing permutationsSANG BANG CHOI; SOMANI, A. K.Journal of parallel and distributed computing (Print). 1993, Vol 19, Num 2, pp 125-130, issn 0743-7315Article

Reduced crossbar switch with minimum number of switching cellsOBARA, H.Electronics Letters. 2008, Vol 44, Num 14, pp 888-889, issn 0013-5194, 2 p.Article

Genetic algorithm based OSPF network routing using LEDATANG, Lenny; WIESE, Kay; KUMAR, Vive et al.Lecture notes in computer science. 2004, pp 571-572, issn 0302-9743, isbn 3-540-22004-6, 2 p.Conference Paper

Compact routing in directed networks with stretch factor of twoCHANDRA, Punit; KSHEMKALYANI, Ajay D.Lecture notes in computer science. 2001, pp 24-35, issn 0302-9743, isbn 3-540-43009-1Conference Paper

Deployment issues in wireless sensor networksLIPING LIU; FENG XIA; ZHI WANG et al.Lecture notes in computer science. 2005, pp 239-248, issn 0302-9743, isbn 3-540-30856-3, 1Vol, 10 p.Conference Paper

A new intuitional algorithm for solving heterogeneous fixed fleet routing problems : Passenger pickup algorithmGENCER, Cevriye; TOP, Ismail; AYDOGAN, Emel Kizilkaya et al.Applied mathematics and computation. 2006, Vol 181, Num 2, pp 1552-1567, issn 0096-3003, 16 p.Article

Structural information and communication complexityPELEG, David; SIBEYN, Jop.Theoretical computer science. 2005, Vol 333, Num 3, issn 0304-3975, 128 p.Conference Proceedings

Routing algorithms for DHTs: Some open questionsRATUASAINY, Sylvia; STOICA, Ion; SHENKER, Scott et al.Lecture notes in computer science. 2002, pp 45-52, issn 0302-9743, isbn 3-540-44179-4, 8 p.Conference Paper

A heuristic routing algorithm for shared protection in connection-oriented networksSHENGLI YUAN; JUE, Jason.SPIE proceedings series. 2001, pp 142-152, isbn 0-8194-4331-XConference Paper

An effective approach to the enhancement of incomplete hypercube computersNIAN-FENG TZENG; HSING-LUNG CHEN.Journal of parallel and distributed computing (Print). 1992, Vol 14, Num 2, pp 163-174, issn 0743-7315Article

Architectural improvements for a Data-Driven VLSI processing arrayWEISS, S; SPILLINGER, I. Y; SILBERMAN, G. M et al.Journal of parallel and distributed computing (Print). 1993, Vol 19, Num 4, pp 308-322, issn 0743-7315Article

An algorithm for node-capacitated ring routingFRANK, Andras; KIRALY, Zoltan; KOTNYEK, Balazs et al.Lecture notes in computer science. 2005, pp 249-258, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 10 p.Conference Paper

A genetic routing algorithm for a 2D-meshed fault-tolerant network systemSANGMOON LEE; DAEKEUN MOON; HAGBAE KIM et al.Lecture notes in computer science. 2002, pp 39-46, issn 0302-9743, isbn 3-540-43968-4, 8 p.Conference Paper

Optimal routing algorithm and the diameter of the Cube-Connected CyclesMELIKSETIAN, D. S; CHEN, C. Y. R.IEEE transactions on parallel and distributed systems. 1993, Vol 4, Num 10, pp 1172-1178, issn 1045-9219Article

Flexible routing in a mesh networkWAHIDA BANU, R. S. D; VARAPRASAD, G; GOWRI SANKAR, S et al.Digital information exchange. Annual conference. 2004, pp 411-417, 1Vol, 7 p.Conference Paper

kd-Clos: New no-blocking permutation networkMEI MING; DONG LI; BO FU et al.Lecture notes in computer science. 2003, pp 152-156, issn 0302-9743, isbn 3-540-20054-1, 5 p.Conference Paper

A noble routing algorithm for the internet computational GRIDYOUNGYONG KIM.Lecture notes in computer science. 2002, pp 33-37, issn 0302-9743, isbn 3-540-43968-4, 5 p.Conference Paper

Remote time-alignment of interactive services through efficient multicast algorithmsBORELLA, Andrea; CANCELLIERI, Giovanni.European conference on universal multiservice networks. 2000, pp 239-246, isbn 0-7803-6419-8Conference Paper

A new routing algorithm for cyclic shifts on BRGC hypercubesCHIEN-MIN WANG.Information processing letters. 1994, Vol 49, Num 4, pp 165-169, issn 0020-0190Article

Optical Path Dynamic Routing Algorithm based on Traffic PredictionOBARA, Keita; HASEGAWA, Hiroshi; SATO, Ken-Ichi et al.Proceedings of SPIE, the International Society for Optical Engineering. 2008, Vol 7137, issn 0277-786X, isbn 9780819473776, Part II, 713724.1-713724.5, 2Conference Paper

A limited path unicast QoS routing algorithmYANXING ZHENG; JING TIAN; ZHIFENG LIU et al.IEEE symposium on computers communications. 2004, isbn 0-7803-8623-X, 2Vol, vol2, 870-875Conference Paper

A list based threshold accepting algorithm for the capacitated vehicle routing problemTARANTILIS, C. D; KIRANOUDIS, C. T; VASSILIADIS, V. S et al.International journal of computer mathematics. 2002, Vol 79, Num 5, pp 537-553, issn 0020-7160Article